Minimal vertex degree sum of a 3-path in plane maps
نویسنده
چکیده
Let wk be the minimum degree sum of a path on k vertices in a graph. We prove for normal plane maps that: (1) if w2 = 6, then w3 may be arbitrarily big, (2) if w2 > 6, then either w3 ≤ 18 or there is a ≤ 15-vertex adjacent to two 3-vertices, and (3) if w2 > 7, then w3 ≤ 17.
منابع مشابه
Some Results on Forgotten Topological Coindex
The forgotten topological coindex (also called Lanzhou index) is defined for a simple connected graph G as the sum of the terms du2+dv2 over all non-adjacent vertex pairs uv of G, where du denotes the degree of the vertex u in G. In this paper, we present some inequalit...
متن کاملLight subgraphs of graphs embedded in the plane and in the projective plane – a survey –
It is well known that every planar graph contains a vertex of degree at most 5. A theorem of Kotzig states that every 3-connected planar graph contains an edge whose endvertices have degree-sum at most 13. Recently, Fabrici and Jendrol’ proved that every 3-connected planar graph G that contains a k-vertex path, a path on k vertices, contains also a k-vertex path P such that every vertex of P ha...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملLight stars in large polyhedral maps on surfaces
It is well known that every polyhedral map with large enough number of vertices contains a vertex of degree at most 6. In this paper the existence of stars having low degree sum of their vertices in polyhedral maps is investigated. We will prove: if G is a polyhedral map on compact 2-manifold M with non-positive Euler characteristic (M) and G has more than 149| (M)| vertices then G contains an ...
متن کاملNote on the weight of paths in plane triangulations of minimum degree 4 and 5
The weight of a path in a graph is defined to be the sum of degrees of its vertices in entire graph. It is proved that each plane triangulation of minimum degree 5 contains a path P5 on 5 vertices of weight at most 29, the bound being precise, and each plane triangulation of minimum degree 4 contains a path P4 on 4 vertices of weight at most 31.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 17 شماره
صفحات -
تاریخ انتشار 1997